Comparing Star and Pancake Networks
نویسندگان
چکیده
Low dilation embeddings are used to compare similarities between star and pancake networks. The pancake network of dimension n, Pn, has n! nodes, one for each permutation, and an undirected edge between permutations (nodes) when some prefix reversal transforms one permutation into the other. The star network of dimension n, Sn, has n! nodes, one for each permutation, and an undirected edge between permutations (nodes) when the exchange of the first element with some other element transforms one permutation into the other. Comparisons with the burnt pancake network are also discussed. The burnt pancake network, BPn, has 2n·n! nodes, one for each signed permutation, and an undirected edge between signed permutations (nodes) when some prefix reversal transforms one signed permutation into the other, and all symbols in the reversed prefix change sign. Some of the embeddings shown are: • n 2 1 dil n S P ⇒ , • ( ) 2 / 4 5n 4n n 1 dil n 2 3 P S + + − ⇒ • n 2 1 dil n S BP ⇒ , • 2 n 2 2 dil n P S − ⇒
منابع مشابه
Embedding hypercubes into pancake, cycle prefix and substring reversal networks
Among Cayley graphs on the symmetric group, some that have noticeably low diameter relative to the number of generators involved are the pancake network, burnt pancake network, and cycle prefix network [1,6,7,8]. Another such Cayley graph is the star network, and constructions have been given for one-to-one and one-tomany low dilation embeddings of hypercubes into star networks [11,12,15]. For ...
متن کاملFundamental algorithms for the star and pancake interconnection networks with applications to computational geometry
The star and pancake networks were recently proposed as attractive alternatives to the hypercube topology for interconnecting processors in a parallel computer. However, few parallel algorithms are known for these networks. In this paper, we present several data communication schemes and basic algorithms for these two networks. These algorithms are then used to develop parallel solutions to var...
متن کاملOptimal Information Dissemination in Star and Pancake Networks
This paper presents a new decomposition technique for hierarchical Cayley graphs. This technique yields a very easy implementation of the divide & conquer paradigm for weak order problems on very complex architectures as the Star graph or the Pancake. As applications, we introduce asymptotically optimal algorithms for Broadcasting, Gossiping, and Semigroup operations for such interconnection ne...
متن کاملEmbedding of Meshes on Rotator Graphs
PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL Abstract { A set of directed permutation graphs called rotator graphs were proposed as an alternative to the star and pancake graphs for multiprocessor interconnection networks. The rotator graphs have a smaller diameter than star and pancake graphs for the same number of nodes, while sharing the...
متن کامل